Lifting involutions in a Weyl group to the torus normalizer

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Involutions in Weyl Groups

Let G be a split real group with Weyl group W . Let E be an irreducible representation of W . Let V be the stable Lie algebra version of the coherent continuation representation of W . The main result of this paper is a formula for the multiplicity of E in V . The formula involves the position of E in Lusztig’s set ∐ M(G). The paper treats all quasi-split groups G as well.

متن کامل

The Weyl Group as Xed Point Set of Smooth Involutions

We show that the Weyl group W = M 0 =M of a noncompact semisimple Lie group is obtained by taking xed point sets of smooth involutions in K=M. More precisely, one considers rst the xed point set X of the involutions deened on K=M by the elements of order 2 in exp ia. The Weyl group is either X , or the xed point set of the involutions deened on X by special elements of order 4 in exp ia.

متن کامل

The Essential Dimension of the Normalizer of a Maximal Torus in the Projective Linear Group

Let p be a prime, k be a field of characteristic 6= p and N be the normalizer of the maximal torus in the projective linear group PGLn. We compute the exact value of the essential dimension edk(N ; p) of N at p for every n ≥ 1.

متن کامل

Algorithms for Twisted Involutions in Weyl Groups

Let (W,Σ) be a finite Coxeter system, and θ an involution such that θ(∆) = ∆, where ∆ is a basis for the root system Φ associated with W , and Iθ = {w ∈ W | θ(w) = w−1} the set of θ-twisted involutions in W . The elements of Iθ can be characterized by sequences in Σ which induce an ordering called the Bruhat poset. The main algorithm of this paper computes this poset. Algorithms for finding con...

متن کامل

Hecke algebras and involutions in Weyl groups

(Py,w;i ∈ N, u is an indeterminate) were defined and computed in terms of an algorithm for any y ≤ w in W . These polynomials are of interest for the representation theory of complex reductive groups, see [6]. Let I = {w ∈ W ;w2 = 1} be the set of involutions in W . In this paper we introduce some new polynomials P σ y,w = ∑ i≥0 P σ y,w;iu i (P σ y,w;i ∈ Z) for any pair y ≤ w of elements of I. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Representation Theory of the American Mathematical Society

سال: 2018

ISSN: 1088-4165

DOI: 10.1090/ert/513